Revising threshold functions

A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in terms of the resource one is interested in) is polynomial in the syntactic distance between the initial and the target concept, but only polylogarithmic in the number of variables in the universe. We give an efficient revision algorithm in the model of learning with equivalence and membership queries for threshold functions, and some negative results showing, for instance, that threshold functions cannot be revised efficiently from either type of query alone. The algorithms work in a general revision model where both deletion and addition type revision operators are allowed.     

Threshold and growth mechanism of fatigue cracks under mode II and III loadings

ABSTRACT The fatigue crack growth behaviour of 0.47% carbon steel was studied under mode II and III loadings. Mode II fatigue crack growth tests were carried out using specially designed double cantilever (DC) type specimens in order to measure the mode II threshold stress intensity factor range, ΔK_IIth. The relationship ΔK_IIth > ΔK_Ith caused crack branching from mode II to I after a crack reached the mode II threshold. Torsion fatigue tests on circumferentially cracked specimens were carried out to study the mechanisms of both mode III crack growth and of the formation of the factory‐roof crack surface morphology. A change in microstructure occurred at a crack tip during crack growth in both mode II and mode III shear cracks. It is presumed that the crack growth mechanisms in mode II and in mode III are essentially the same. Detailed fractographic investigation showed that factory‐roofs were formed by crack branching into mode I. Crack branching started from small semi‐elliptical cracks nucleated by shear at the tip of the original circumferential crack.     

Estimating and eliminating redundant data transfers over the web: a fragment based approach

Redundant data transfers over the Web, can be mainly attributed to the repeated transfers of unchanged data. Web caches and Web proxies are some of the solutions that have been proposed, to deal with the issue of redundant data transfers. In this paper we focus on the efficient estimation and reduction of redundant data transfers over the Web. We first prove that a vast amount of redundant data is transferred in Web pages that are considered to carry fresh data. We show this by following an approach based on Web page fragmentation and manipulation. Web pages are broken down to fragments, based on specific criteria. We then deal with these fragments as independent constructors of the Web page and study their change patterns independently and in the context of the whole Web page. After the fragmentation process, we propose solutions for dealing with redundant data transfers. This paper has been based on our previous work on ‘Web Components’ but also on related work by other researchers. It utilises a proxy based, client/server architecture, and imposes changes to the algorithms executed on the Proxy server and on clients. We show that our proposed solution can considerably reduce the amount of redundant data transferred on the Web. Copyright © 2004 John Wiley & Sons, Ltd.     

基于遗传算法的门限自回归模型在浅层地下水位预测中的应用

提出了建立门限自回归模型的一种简便通用的方法，用遗传算法可同时优化门限值和自回归系数．实例计算的结果说明了其可行性和有效性．该方法在各种工程时序预测中具有广泛的应用价值     

角调谐飞秒同步泵浦KTP红外光参量振荡器

用平均输出功率为１．１Ｗ，脉宽为９０ｆｓ的商用再生锁模Ｔｉ：Ｓａｐｐｈｉｒｅ激光器作为泵浦源，用ＫＴＰ作为非线性光学介质，制成一台同步泵浦飞秒光学参量振荡器。其输出调谐范围为１．０４μｍ至１．２６μｍ，平均输出功率在１００ｍｗ左右，脉宽仅约１００ｆｓ。     

13SiMnNiCrMoV钢切口疲劳裂纹萌生门槛值

本文研究在13SiMnNiCrMoV 结构钢中用尖裂纹的应力强度因子来反映三点弯曲缺口试样的疲劳裂纹萌生规律。当 R=0.1,f=100Hz,试样尺寸 B×W×L=12.5×25×117mm 时,缺口名义应力幅的门槛值为Δσ_(th)=3315ρ~(0.352) MPa,0.5mm≤ρ≤5mmΔK_(th)=250ρ~(0.352) MPam~(1/2)门槛值与ρ有关。同时得到缺口裂纹萌生的循环次数 N_i 与名义应力幅Δσ、缺口曲率半径ρ的定量关系是N_i=3.98×10~(22)ρ~(1.62)/Δσ~(4.85),N_i≤10~(5.5)并讨论了(ΔK_1/ρ~(1/2))_(th)与ρ无关的结论。     

匿名技术的研究进展

对匿名技术的研究情况进行了综述。统一给出了关联性、匿名性、假名等概念,探讨了Crowds、洋葱路由、Mix nets等匿名通信的实现机制,介绍了有关的研究进展,指出了匿名性度量、环签名和群签名等匿名签名算法、匿名应用中信赖的建立等技术中需要进一步研究的问题。     

稀疏气泡流动的粒子跟踪测速技术研究

采用动态阈值技术实现了对气泡图像的正确分割，利用灰度加权方法提高了气泡颗粒的定位精度。根据稀疏气泡流动图像的特点，提出了一种新的基于相关的粒子跟踪测速算法（2-HPTV）。通过进行两时刻中围绕待研究气泡所取的两个小的诊断窗口的相关运算，成功实现了气泡颗粒的轨迹追踪。实验表明本文算法较传统的PIV技术在测速精度上有很大程度的提高，与4帧粒子跟踪测速算法相比，降低了对摄像机帧频的要求，具有较强的实用性。     

浅析免撤销公钥框架（PKI）

数字签名通常作为不可反驳的密码学证据用于解决电子交易中的纷争，但是其可信的时间戳和证书撤销服务在实际使用中代价很高。免撤销公钥框架作为一种新的PKI使得终端用户可以控制他自己的公钥证书的有效性，使验证证书不需要折回到CA去获取证书撤销信息．从而降低其使用代价。     

A novel optical burst switching scheme—logical cascaded private subnet with start wavelength assignment policy

Many recent studies have convincingly demonstrated that network traffic exhibits a noticeable self-similar nature, which has a considerable impact on network performance, and most studies of optical burst switching (OBS) networks are under a fundamental assumption that full wavelength conversion is available throughout the network. In practice, however, economic and technical considerations are likely to dictate a more limited and sparse deployment of wavelength converters in the optical network. Therefore, we present a novel scheme for OBS networks, called logical cascaded private subnet (LCPN) with start wavelength assignment policy. We define the concept of canoe relative to cluster in self-similar traffic, and introduce a new device named payload segregator at the edge node as a gateway to the core node in OBS Networks. According to the changes in the edge node framework, we put forward the concept of cluster private subnet and canoe private subnet in the core node correspondingly. A new start wavelength assignment policy is proposed for the absence of (full) wavelength conversion capabilities in the core node of OBS Networks. The performance study indicates that, our new scheme is robust under self-similar traffic and wavelength continuity constraint.